Bivariate Extensions of Abramov's Algorithm for Rational Summation
نویسنده
چکیده
Abramov’s algorithm enables us to decide whether a univariate rational function can be written as a difference of another rational function, which has been a fundamental algorithm for rational summation. In 2014, Chen and Singer generalized Abramov’s algorithm to the case of rational functions in two (q-)discrete variables. In this paper we solve the remaining three mixed cases, which completes our recent project on bivariate extensions of Abramov’s algorithm for rational summation.
منابع مشابه
Bivariate Extensions of Abramov’s Algorithm for Rational Summation Dedicated to Professor Sergei A. Abramov on the occasion of his 70th birthday
Abramov’s algorithm enables us to decide whether a univariate rational function can be written as a difference of another rational function, which has been a fundamental algorithm for rational summation. In 2014, Chen and Singer have generalized Abramov’s algorithm to the case of rational functions in two (q-)discrete variables. In this paper we solve the remaining three mixed cases, which comp...
متن کاملA New Algorithm for the Recursion of Hypergeometric Multisums
We introduce a new algorithm to find recursions of proper hypergeometric multisums. Our algorithm treats one summation variable at a time, and provides rational certificates along the way. We also provide an algorithm to construct a polynomial divisible by the denominator of any rational solution x(n) to am(n) bm(n) x(n + m) + · · · + a 0 (n) b 0 (n) x(n) = c(n) d(n) , where a i (n), b i (n), c...
متن کاملA New Algorithm for the Recursion of Hypergeometric Multisums with Improved Universal Denominator
The purpose of the paper is to introduce two new algorithms. The first one computes a linear recursion for proper hypergeometric multisums, by treating one summation variable at a time, and provides rational certificates along the way. A key part in the search of a linear recursion is an improved universal denominator algorithm that constructs all rational solutions x(n) of the equation am(n) b...
متن کاملSome applications of differential-difference algebra to creative telescoping. (Quelques applications de l'algébre différentielle et aux différences pour le télescopage créatif)
Since the 1990’s, Zeilberger’s method of creative telescoping has played an important role in the automatic verification of special-function identities. The long-term goal initiated in this work is to obtain fast algorithms and implementations for definite integration and summation in the framework of this method. Our contributions include new practical algorithms, complexity analyses of algori...
متن کاملSimplifying Sums in Πς ∗ - Extensions Carsten
We present telescoping algorithms which compute optimal sum representations of indefinite nested sums. More precisely, given a rational summand expression in terms of nested sums and products, the algorithm splits the summand into a summable part, which can be summed by telescoping, and into a non-summable part, which is degree-optimal with respect to one of the most nested sums or products. If...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1706.09134 شماره
صفحات -
تاریخ انتشار 2017